Berge’s Theorem for Noncompact Image Sets
نویسندگان
چکیده
For an upper semi-continuous set-valued mapping from one topological space to another and for a lower semi-continuous function defined on the product of these spaces, Berge’s theorem states lower semi-continuity of the minimum of this function taken over the image sets. It assumes that the image sets are compact. For Hausdorff topological spaces, this paper extends Berge’s theorem to set-valued mappings with possible noncompact image sets and studies relevant properties of minima.
منابع مشابه
Continuity of Minima: Local Results
This paper compares and generalizes Berge’s maximum theorem for noncompact image sets established in Feinberg, Kasyanov and Voorneveld [5] and the local maximum theorem established in Bonnans and Shapiro [3, Proposition 4.4].
متن کاملBerge’s Maximum Theorem for Non-compact Image Sets and Its Applications
Session 1. 8:40 10:15 AM. Melamed Benjamin Rutgers University, Chair Berge’s Maximum Theorem for Non-compact Image Sets and Its Applications. Pavlo Kasyanov, Kyiv Polytechnic Institute & World Data Center, Ukraine and Eugene A. Feinberg, Stony Brook University. For an upper semi-continuous set-valued mapping from one topological space to another and for a lower semi-continuous function defined ...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملA New Proof of Berge’s Strong Path Partition Conjecture for Acyclic Digraphs
Berge’s elegant strong path partition conjecture from 1982 extends the Greene-Kleitman Theorem and Dilworth’s Theorem for all digraphs. The conjecture is known to be true for all digraphs for k = 1 by the Gallai-Milgram Theorem, and for k > 1 only for acyclic digraphs. We present a simple algorithmic proof for k = 1 which naturally extends to a new algorithmic proof for acyclic digraphs for all...
متن کاملStrong Vector Equilibrium Problems on Noncompact Sets
In this paper, by using the famous Brouwer fixed point theorem, some existence theorems of strong efficient solutions for the strong vector equilibrium problems are obtained on noncompact sets of general real Hausdorff topological vector spaces without assuming that the dual of the ordering cone has a weak∗ compact base. Moreover, the closeness and the convexity of the strong efficient solution...
متن کامل